Two-message quantum interactive proofs and the quantum separability problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Interactive Proofs and the Complexity of Separability Testing

We identify a formal connection between physical problems related to the detection of separable (unentangled) quantum states and complexity classes in theoretical computer science. In particular, we show that to nearly every quantum interactive proof complexity class (including BQP, QMA, QMA(2), and QSZK), there corresponds a natural separability testing problem that is complete for that class....

متن کامل

Interactive Proofs For Quantum Computations

Making the computation of U|x〉 blind: we use a universal circuit Q, which on input |“U”〉 |x〉 outputs |“U”〉 U|x〉 Fault tolerance: we adapt standard techniques to the QPIP protocol. Care is due since the verifier needs to prepare authenticated states sequentially, due to lack of space. Interactive View of Shor’s Algorithm For N=xy,x≤y decide whether xi=1 P sends x,y: x≤y & xy=N. V accepts if xy=N...

متن کامل

Interactive Proofs For Quantum Computation

The widely held belief that BQP strictly contains BPP raises fundamental questions: Upcoming generations of quantum computers might already be too large to be simulated classically. Is it possible to experimentally test that these systems perform as they should, if we cannot efficiently compute predictions for their behavior? Vazirani has asked [Vaz07]: If computing predictions for Quantum Mech...

متن کامل

Computational complexity of the quantum separability problem

Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first systematic and comprehensive treatment of this (bipartite) quantum separability problem, focusing on its deterministic (as opposed to randomized) computationa...

متن کامل

The Quantum Separability Problem for Gaussian States

The concept of entanglement arose with the question of completeness of quantum theory [1]. Nowadays entanglement is regarded as a fundamental property of certain quantum states and it appears to be an important physical resource. In some sense, entanglement is synonymous of inseparability because entangled states possess some global properties that cannot be explained in terms of only the parti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum Information and Computation

سال: 2014

ISSN: 1533-7146,1533-7146

DOI: 10.26421/qic14.5-6-2